On converse results for secure index coding

Title: On converse results for secure index coding
Creator: Liu, Yucheng; Ong, Lawrence; Sadeghi, Parastoo; Aboutorab, Neda; Sharififar, Arman
Relation: 2021 IEEE Information Theory Workshop (ITW). 2021 IEEE Information Theory Workshop (ITW) (Kanazawa, Japan 17-21 October, 2021) p. 1-6
Publisher Link: http://dx.doi.org/10.1109/ITW48936.2021.9611425
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Resource Type: conference paper
Date: 2021
Description: In this work, we study the secure index coding problem where there are security constraints on both legitimate receivers and eavesdroppers. We develop two performance bounds (i.e., converse results) on the symmetric secure capacity. The first one is an extended version of the basic acyclic chain bound (Liu and Sadeghi, 2019) that takes security constraints into account. The second converse result is a novel information-theoretic lower bound on the symmetric secure capacity, which is interesting as all the existing converse results in the literature for secure index coding give upper bounds on the capacity.
Subject: upper bound; conferences; receivers; encoding; indexes; security
Identifier: http://hdl.handle.net/1959.13/1449850
Identifier: uon:43763
Identifier: ISBN:9781665431378
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format